منابع مشابه
Quasiperiodicity and String Covering
In this paper, we study word regularities and in particular extensions of the notion of the word period: quasiperiodicity, covers and seeds. We present overviews of algorithms for computing the quasiperiodicity, the covers and the seeds of a given word. We also present an overview of an algorithm that finds maximal word factors with the above regularities. Finally, we show how Fine and Wilf’s T...
متن کاملConservative String Covering of Indeterminate Strings
We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T [1]T [2] . . . T [n], where T [i] ⊆ Σ for each i, and Σ is a given alphabet of fixed size. A conservative indeterminate string, is an indeterminate string where the number of indeterminate symbols in the positions of the string, i.e the non-...
متن کاملCovering a Circular String with Substrings of Fixed Length
A nonempty circular string C(x) of length n is said to be covered by a set U k of strings each of xed length k n ii every position in C(x) lies within an occurrence of some string u 2 U k. In this paper we consider the problem of determining the minimum cardinality of a set U k which guarantees that every circular string C(x) of length n k can be covered. In particular, we show how, for any pos...
متن کاملDEVELOPMENT IN STRING THEORY
The string theory is a fast moving subject, both physics wise and in the respect of mathematics. In order to keep up with the discipline it is important to move with new ideas which are being stressed. Here I wish to give extracts from new papers of ideas which I have recently found interesting. There are six papers which are involved: I ."Strings formulated directly in 4 dimensions " A. N...
متن کاملNew Enhanced Exact String Searching Algorithm
Exact string Searching is one of the most important problems that had been investigated by many studies ranging from finding the shortest common super string in DNA sequencing to searching for occurrences of a pattern occurs in text editors. In this paper, a new Enhanced Checking and Skipping Algorithm (ECSA) is introduced. The new algorithm enhance the classical string searching algorithms by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.08.013